منابع مشابه
Fuzzy Transportation Problem with Random Transportation Costs
We consider the following transportation problem with both random and fuzzy factors. There exist m supply points and n demand points. For each route between supply point and demand point, unit transportation cost is a random variable according to a normal distribution and existence possibility denoting the preference choosing this route is attached. The probability that the total transportation...
متن کاملFully Fuzzy Transportation Problem
Transportation problem is a linear programming which considers minimum cost for shipping a product from some origins to other destinations such as from factories to warehouse, or from a warehouse to supermarkets. To solve this problem simplex algorithmis utilized. In real projects costs and the value of supply and demands are fuzzy numbers and it is expected that optimal solutions for determini...
متن کاملOn the transportation problem with market choice
We study a variant of the classical transportation problem in which suppliers with limited capacities have a choice of which demands (markets) to satisfy. We refer to this problem as the transportation problem with market choice (TPMC). While the classical transportation problem is known to be strongly polynomial-time solvable, we show that its market choice counterpart is strongly NP-complete....
متن کاملThe transportation problem with exclusionary side constraints
We consider the so-called Transportation Problem with Exclusionary Side Constraints (TPESC), which is a generalization of the ordinary transportation problem. We confirm that the TPESC is NP -hard, and we analyze the complexity of different special cases. For instance, we show that in case of a bounded number of suppliers, a pseudo-polynomial time algorithm exists, whereas the case of two deman...
متن کاملTraveling Salesman Problem with Transportation
Traveling Salesman Problem (TSP) is a generic name that includes diverse practical models. Motivated by applications, a new model of TSP is examined — a synthesis of classical TSP and classical Transportation Problem. Algorithms based on Integer Programming cutting-plane methods and Branch and Bound Techniques are obvious. Mathematics Subject Classification 2000: 91A05, 91A06, 91A10, 91A44, 90C...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2017
ISSN: 1556-5068
DOI: 10.2139/ssrn.3082778